Spectral graph theory: Cheeger constants and discrepancy∗
نویسنده
چکیده
In this third talk we will discuss properties related to edge expansion. In particular, we will define the Cheeger constant (which measures how easy it is to cut off a large piece of the graph) and state the Cheeger inequalities. We also will define and discuss discrepancy for undirected and directed graphs. We also state the Perron-Frobenius Theorem which is a useful tool in spectral graph theory, particularly for directed graphs.
منابع مشابه
Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
We introduce a family of multi-way Cheeger-type constants {h k , k = 1, 2, . . . , N} on a signed graph Γ = (G, σ) such that h k = 0 if and only if Γ has k balanced connected components. These constants are switching invariant and bring together in a unified viewpoint a number of important graph-theoretical concepts, including the classical Cheeger constant, the non-bipartiteness parameter of D...
متن کاملMAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 20: Introduction to Spectral Graph Theory–III. Graph Cut and Cheeger Constants, Isospectral Graphs, and Discrete Laplacian Eigenvalue Problems
Example 1.2. In Figure 1, S is the set of dark nodes, and the dotted lines form ∂S. S ∆ = V \S. Also, vol(S) = m(S) ∆ = x∈S m(x).
متن کاملCheeger constants, growth and spectrum of locally tessellating planar graphs
In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.
متن کاملLower Bounds on the Cheeger Constants of Highly Connected Regular Graphs
We develop a method for obtaining lower bounds on the Cheeger constants of certain highly connected graphs. We then apply this technique to obtain new lower bounds on the Cheeger constants of two important families of graphs. Finally, we discuss the relevance of our bounds to determining the integrity of these graphs.
متن کاملOn the Asymptotic Isoperimetric Constants for Riemann Surfaces and Graphs
We study the behavior of the Cheeger isoperimetric constant on infinite families of graphs and Riemann surfaces, and its relationship to the first eigenvalue λ1 of the Laplacian. We adapt probabilistic arguments of Bollobás to the setting of Riemann surfaces, and then show that Cheeger constants of the modular surfaces are uniformly bounded from above away from the maximum value. We extend this...
متن کامل